905. Sort Array By Parity - LeetCode Solution

class Solution:
    def sortArrayByParity(self, A: List[int]) -> List[int]:
        g = len(A)-1
        
        k = 0
        
        while g!=k:
            if A[k]%2==0:
                k+=1
            else:
                A[k], A[g] = A[g], A[k]
                g-=1
            
        return A